An Infinite Family of Linear Codes Supporting 4-Designs
نویسندگان
چکیده
The question as to whether there exists an infinite family of near MDS codes holding t-designs for t ? 2 was answered in the recent paper [Infinite families t-designs, IEEE Trans. Inf. Theory 66(9) (2020)], where 3-designs and 2-designs were presented, but no linear 4-designs presented. Hence, is remains open 71 years. This settles this longstanding problem by presenting BCH length m+1 +1 over GF(2 xmlns:xlink="http://www.w3.org/1999/xlink">2m+1 ) 4-(2 + 1, 6, xmlns:xlink="http://www.w3.org/1999/xlink">2m - 4) designs. also provides another solution first question, some presented are MDS. Moreover, spherical geometry design S(3, 5, 4 xmlns:xlink="http://www.w3.org/1999/xlink">m 1) new direction searching with elementary symmetric polynomials will be further advanced.
منابع مشابه
An infinite family of symmetric designs
In this paper, using the construction method of [3], we show that if q>2 is a prime power such that there exists an affine plane of order q -1, then there exists a ~trongly divisible 2 -«q -1)(qh -1), qh-l(q -1), qh-l) design for every h;;. 2. We show that these quasi-residual designs are embeddable, and hence establish the existence of an infinite family of symmetric 2_(qh+l_q + 1, qh, qh-l) d...
متن کاملCodes over an infinite family of algebras
In this paper, we will show some properties of codes over the ring Bk = Fp[v1, . . . , vk]/(v i = vi, ∀i = 1, . . . , k). These rings, form a family of commutative algebras over finite field Fp. We first discuss about the form of maximal ideals and characterization of automorphisms for the ring Bk. Then, we define certain Gray map which can be used to give a connection between codes over Bk and...
متن کاملInfinite families of 2-designs and 3-designs from linear codes
The interplay between coding theory and t-designs started many years ago. While every t-design yields a linear code over every finite field, the largest t for which an infinite family of t-designs is derived directly from a linear or nonlinear code is t = 3. Sporadic 4-designs and 5-designs were derived from some linear codes of certain parameters. The major objective of this paper is to constr...
متن کاملAn infinite Family of Non-embeddable Hadamard Designs
The parameters 2 (2λ + 2, λ + 1, λ) are those of a residual Hadamard 2 (4λ + 3, 2λ + 1, λ) design. All 2 (2λ + 2, λ + 1, λ) designs with λ ≤ 4 are embeddable. The existence of non-embeddable Hadamard 2-designs has been determined for the cases λ = 5, λ = 6, and λ = 7. In this paper the existence of an infinite family of non-embeddable 2 (2λ + 2, λ + 1, λ) designs, λ = 3(2m)− 1,m ≥ 1 is establis...
متن کاملAn infinite family of Steiner systems S(2, 4, 2m) from cyclic codes
Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are S(2,3,v) (Steiner triple systems), S(3,4,v) (Steiner quadruple systems), and S(2,4,v). There are a few infinite families of Steiner systems S(2,4,v) in the literature. The objective of this paper is to present an infinite family of Steiner systems S(2,4,2m) for all m ≡ 2 (mod 4)≥ 6 from cyclic codes. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3032600